MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { f(X) -> f(a())
  , b() -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

We use the processor 'matrix interpretation of dimension 1' to
orient following rules strictly.

Trs: { b() -> a() }

The induced complexity on above rules (modulo remaining rules) is
YES(?,O(n^1)) . These rules are moved into the corresponding weak
component(s).

Sub-proof:
----------
  TcT has computed the following constructor-based matrix
  interpretation satisfying not(EDA).
  
    [f](x1) = [3] x1 + [3]
                          
        [a] = [0]         
                          
        [b] = [3]         
  
  This order satisfies the following ordering constraints:
  
    [f(X)] =  [3] X + [3]
           >= [3]        
           =  [f(a())]   
                         
     [b()] =  [3]        
           >  [0]        
           =  [a()]      
                         

We return to the main proof.

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs: { f(X) -> f(a()) }
Weak Trs: { b() -> a() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

Empty strict component of the problem is NOT empty.

Arrrr..